Ak-shell decomposition method for weighted networks

A k-shell decomposition method for weighted networks

We present a generalized method for calculating the k-shell structure of weighted networks. The method takes into account both the weight and the degree of a network, in such a way that in the absence of weights we resume the shell structure obtained by the classic k-shell decomposition. In the presence of weights, we show that the method is able to partition the network in a more refined way, ...

Non-conforming Domain Decomposition Method for Plate and Shell Problems

The mortar element method is an optimal domain decomposition method for the approximation of partial differential equations on non-matching grids. There already exists applications of the mortar method to Navier-Stokes, elasticity, and Maxwell problems. The aim of this paper is to provide an extension of the mortar method to plates and shells problems. We first recall the Discrete Kirchhoff Tri...

A Method for Defuzzication by Weighted Distance

Compare Adomian Decomposition Method and Laplace Decomposition Method for Burger's-Huxley and Burger's-Fisher equations

In this paper, Adomian decomposition method (ADM) and Laplace decomposition method (LDM) used to obtain series solutions of Burgers-Huxley and Burgers-Fisher Equations. In ADM the algorithm is illustrated by studying an initial value problem and LDM is based on the application of Laplace transform to nonlinear partial differential equations. In ADM only few terms of the expansion are required t...

Computable Shell Decomposition Bounds

Haussler, Kearns, Seung and Tishby introduced the notion of a shell decomposition of the union bound as a means of understanding certain empirical phenomena in learning curves such as phase transitions. Here we use a variant of their ideas to derive an upper bound on the generalization error of a hypothesis computable from its training error and the histogram of training errors for the hypothes...